Small cycle transversals in tournaments

نویسندگان

  • Jørgen Bang-Jensen
  • Stéphane Bessy
چکیده

We prove that every tournament T with no three disjoint cycles contains a set X of at most four vertices such that T −X is acyclic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

t-Pancyclic Arcs in Tournaments

Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...

متن کامل

Two-Path Convexity and Bipartite Tournaments of Small Rank

We study two-path convexity in bipartite tournaments. For a bipartite tournament, we obtain both a necessary condition and a sufficient condition on the adjacency matrix for its rank to be two. We then investigate 4-cycles in bipartite tournaments of small rank. We show that every vertex in a bipartite tournament of rank two lies on a four cycle, and bipartite tournaments with a maximum number ...

متن کامل

Multipartite tournaments with small number of cycles

L. Volkmann, Discrete Math. 245 (2002) 19-53 posed the following question. Let 4 ≤ m ≤ n. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n − m + 1 cycles of length m? We answer this question in affirmative. We raise the following problem. Given m ∈ {3, 4, . . . , n}, find a characterization of strong n-partite tournaments having exactly n −m + 1 cycle...

متن کامل

On n-partite Tournaments with Unique n-cycle

An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n ≥, we characterize strongly connected n-partite tournaments ...

متن کامل

A study of Nilpotent groups through right transversals

In group theory nilpotency of a group has a great importance. In this paper we have studied some concept of nilpotency through right transversals. We have also studied prime power groups and frattini subgroups through right transversals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013